منابع مشابه
Disjoint Paths in Symmetric Digraphs
Given a number of requests `, we propose a polynomial-time algorithm for finding ` disjoint paths in a symmetric directed graph. It is known that the problem of finding ` ≥ 2 disjoint paths in a directed graph is NP-hard [S. Fortune, J. Hopcroft, J. Wyllie, The directed subgraph homeomorphism problem, Journal of Theoretical Computer Science 10 (2) (1980) 111–121]. However, by studying minimal s...
متن کاملFree multiflows in bidirected and skew-symmetric graphs
A graph (digraph) G = (V,E) with a set T ⊆ V of terminals is called inner Eulerian if each nonterminal node v has even degree (resp. the numbers of edges entering and leaving v are equal). Cherkassky [1] and Lovász [15] showed that the maximum number of pairwise edge-disjoint T -paths in an inner Eulerian graph G is equal to 1 2 ∑ s∈T λ(s), where λ(s) is the minimum number of edges whose remova...
متن کاملTranspose on vertex symmetric digraphs
In [2] (and earlier in [3]), we defined several global communication tasks (universal exchange, universal broadcast, universal summation) on directed or vertex symmetric networks. In that paper, we mainly focused on universal broadcast. In [4], we discussed universal sum. Here we continue this work and focus on universal exchange (transpose) in directed vertex symmetric graphs. Introduction. In...
متن کاملLinkless symmetric drawings of series parallel digraphs
In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteria in graph drawing. More specifically, we present two algorithms: a symmetry finding algorithm wh...
متن کاملVertex-symmetric Digraphs with Small Diameter
There is increasing interest in the design of dense vertex-symmetric graphs and digraphs as models of interconnection networks for implementing parallelism. In these systems many nodes are connected with relatively few links and short paths between them and each node may execute, without modifications, the same communication software. In this paper we give new families of dense vertex-symmetric...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.05.008